Solving Molecular Docking Problems with Multi-Objective Metaheuristics
نویسندگان
چکیده
منابع مشابه
Solving molecular docking problems with multi-objective metaheuristics.
Molecular docking is a hard optimization problem that has been tackled in the past with metaheuristics, demonstrating new and challenging results when looking for one objective: the minimum binding energy. However, only a few papers can be found in the literature that deal with this problem by means of a multi-objective approach, and no experimental comparisons have been made in order to clarif...
متن کاملSolving Multi-Objective Combinatorial Optimisation with Metaheuristics
It is well known that, on the one hand, combinatorial optimization (CO) provides a powerful tool to formulate and model many optimization problems, on the other hand, a multi-objective (MO) approach is often a realistic and efficient way to treat many real world applications. Nevertheless, until recently, Multi-Objective Combinatorial Optimization (MOCO) did not receive much attention in spite ...
متن کاملMulti-objective Phylogenetic Algorithm: Solving Multi-objective Decomposable Deceptive Problems
In general, Multi-objective Evolutionary Algorithms do not guarantee find solutions in the Pareto-optimal set. We propose a new approach for solving decomposable deceptive multi-objective problems that can find all solutions of the Pareto-optimal set. Basically, the proposed approach starts by decomposing the problem into subproblems and, then, combining the found solutions. The resultant appro...
متن کاملA Hybrid MOEA/D-TS for Solving Multi-Objective Problems
In many real-world applications, various optimization problems with conflicting objectives are very common. In this paper we employ Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), a newly developed method, beside Tabu Search (TS) accompaniment to achieve a new manner for solving multi-objective optimization problems (MOPs) with two or three conflicting objectives. This i...
متن کاملSolving Multi-objective Pseudo-Boolean Problems
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these problems have a Boolean nature, i.e., the variables are restricted to 0 and 1, so called Pseudo-Boolean solvers have been proposed. They are mostly based on SAT solvers which took continuous improvements over the past years...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Molecules
سال: 2015
ISSN: 1420-3049
DOI: 10.3390/molecules200610154